0.06/0.11 % Problem : SLH187^1 : TPTP v7.5.0. Released v7.5.0. 0.06/0.11 % Command : run_E %s %d THM 0.11/0.32 % Computer : n021.cluster.edu 0.11/0.32 % Model : x86_64 x86_64 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.32 % Memory : 8042.1875MB 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.32 % CPULimit : 30 0.11/0.32 % WCLimit : 30 0.11/0.32 % DateTime : Tue Aug 9 02:29:20 EDT 2022 0.11/0.32 % CPUTime : 0.16/0.43 The problem SPC is TH0_THM_EQU_NAR 0.16/0.43 Running higher-order on 1 cores theorem proving 0.16/0.43 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=1 --cpu-limit=30 /export/starexec/sandbox2/benchmark/theBenchmark.p 0.16/0.43 # Version: 3.0pre003-ho 0.16/0.45 # partial match(1): HSLSSMSSSSMNSFA 0.16/0.45 # Preprocessing class: HSLSSMSSSSMCSFA. 0.16/0.45 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.16/0.45 # Starting post_as_ho6 with 30s (1) cores 0.16/0.45 # post_as_ho6 with pid 26923 completed with status 0 0.16/0.45 # Result found by post_as_ho6 0.16/0.45 # partial match(1): HSLSSMSSSSMNSFA 0.16/0.45 # Preprocessing class: HSLSSMSSSSMCSFA. 0.16/0.45 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.16/0.45 # Starting post_as_ho6 with 30s (1) cores 0.16/0.45 # SinE strategy is GSinE(CountFormulas,,true,2.0,0,3,20000,1.0,true) 0.16/0.45 # ...ProofStateSinE()=45/189 0.16/0.45 # Search class: HGUSM-FSLS31-MSFFFFBN 0.16/0.45 # partial match(1): HGHSM-FSLS31-MSFFFFBN 0.16/0.45 # Scheduled 5 strats onto 1 cores with 30 seconds (30 total) 0.16/0.45 # Starting sh3 with 17s (1) cores 0.16/0.45 # sh3 with pid 26924 completed with status 0 0.16/0.45 # Result found by sh3 0.16/0.45 # partial match(1): HSLSSMSSSSMNSFA 0.16/0.45 # Preprocessing class: HSLSSMSSSSMCSFA. 0.16/0.45 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.16/0.45 # Starting post_as_ho6 with 30s (1) cores 0.16/0.45 # SinE strategy is GSinE(CountFormulas,,true,2.0,0,3,20000,1.0,true) 0.16/0.45 # ...ProofStateSinE()=45/189 0.16/0.45 # Search class: HGUSM-FSLS31-MSFFFFBN 0.16/0.45 # partial match(1): HGHSM-FSLS31-MSFFFFBN 0.16/0.45 # Scheduled 5 strats onto 1 cores with 30 seconds (30 total) 0.16/0.45 # Starting sh3 with 17s (1) cores 0.16/0.45 # Preprocessing time : 0.003 s 0.16/0.45 # Presaturation interreduction done 0.16/0.45 0.16/0.45 # Proof found! 0.16/0.45 # SZS status Theorem 0.16/0.45 # SZS output start CNFRefutation 0.16/0.45 thf(decl_22, type, plus_plus_multiset_a: multiset_a > multiset_a > multiset_a). 0.16/0.45 thf(decl_23, type, zero_zero_multiset_a: multiset_a). 0.16/0.45 thf(decl_24, type, heapIm1140443833left_a: tree_a > tree_a). 0.16/0.45 thf(decl_25, type, heapIm1257206334ight_a: tree_a > tree_a). 0.16/0.45 thf(decl_26, type, heapIm1091024090Down_a: tree_a > tree_a). 0.16/0.45 thf(decl_27, type, e_a: tree_a). 0.16/0.45 thf(decl_28, type, t_a: a > tree_a > tree_a > tree_a). 0.16/0.45 thf(decl_29, type, map_Tree_a_a: (a > a) > tree_a > tree_a). 0.16/0.45 thf(decl_30, type, pred_Tree_a: (a > $o) > tree_a > $o). 0.16/0.45 thf(decl_31, type, rel_Tree_a_a: (a > a > $o) > tree_a > tree_a > $o). 0.16/0.45 thf(decl_32, type, in_tree_a: a > tree_a > $o). 0.16/0.45 thf(decl_33, type, is_heap_a: tree_a > $o). 0.16/0.45 thf(decl_34, type, multiset_a2: tree_a > multiset_a). 0.16/0.45 thf(decl_35, type, val_a: tree_a > a). 0.16/0.45 thf(decl_36, type, lattic146396397_Max_a: set_a > a). 0.16/0.45 thf(decl_37, type, add_mset_a: a > multiset_a > multiset_a). 0.16/0.45 thf(decl_38, type, is_empty_a: multiset_a > $o). 0.16/0.45 thf(decl_39, type, set_mset_a: multiset_a > set_a). 0.16/0.45 thf(decl_40, type, subseteq_mset_a: multiset_a > multiset_a > $o). 0.16/0.45 thf(decl_41, type, ord_le1530450702ee_a_o: (tree_a > tree_a > $o) > (tree_a > tree_a > $o) > $o). 0.16/0.45 thf(decl_42, type, ord_less_eq_Tree_a_o: (tree_a > $o) > (tree_a > $o) > $o). 0.16/0.45 thf(decl_43, type, ord_less_eq_a_a_o: (a > a > $o) > (a > a > $o) > $o). 0.16/0.45 thf(decl_44, type, ord_less_eq_a_o: (a > $o) > (a > $o) > $o). 0.16/0.45 thf(decl_45, type, ord_le1199012836iset_a: multiset_a > multiset_a > $o). 0.16/0.45 thf(decl_46, type, ord_less_eq_a: a > a > $o). 0.16/0.45 thf(decl_47, type, order_Greatest_a: (a > $o) > a). 0.16/0.45 thf(decl_48, type, collect_a: (a > $o) > set_a). 0.16/0.45 thf(decl_49, type, member_a: a > set_a > $o). 0.16/0.45 thf(decl_50, type, t: tree_a). 0.16/0.45 thf(decl_51, type, v: a). 0.16/0.45 thf(decl_52, type, esk1_2: tree_a > a > tree_a). 0.16/0.45 thf(decl_53, type, esk2_2: tree_a > a > a). 0.16/0.45 thf(decl_54, type, esk3_2: tree_a > a > tree_a). 0.16/0.45 thf(decl_55, type, esk4_1: tree_a > a). 0.16/0.45 thf(decl_56, type, esk5_1: tree_a > a). 0.16/0.45 thf(decl_57, type, esk6_1: tree_a > a). 0.16/0.45 thf(decl_58, type, esk7_1: tree_a > tree_a). 0.16/0.45 thf(decl_59, type, esk8_1: tree_a > tree_a). 0.16/0.45 thf(decl_60, type, esk9_1: tree_a > a). 0.16/0.45 thf(decl_61, type, esk10_1: tree_a > a). 0.16/0.45 thf(decl_62, type, esk11_1: tree_a > tree_a). 0.16/0.45 thf(decl_63, type, esk12_1: tree_a > tree_a). 0.16/0.45 thf(decl_64, type, esk13_1: tree_a > a). 0.16/0.45 thf(decl_65, type, esk14_1: tree_a > a). 0.16/0.45 thf(decl_66, type, esk15_1: tree_a > tree_a). 0.16/0.45 thf(decl_67, type, esk16_1: tree_a > tree_a). 0.16/0.45 thf(decl_68, type, esk17_1: tree_a > a). 0.16/0.45 thf(decl_69, type, esk18_1: tree_a > tree_a). 0.16/0.45 thf(decl_70, type, esk19_1: tree_a > tree_a). 0.16/0.45 thf(decl_71, type, esk20_1: tree_a > a). 0.16/0.45 thf(decl_72, type, esk21_1: tree_a > a). 0.16/0.45 thf(decl_73, type, esk22_1: tree_a > a). 0.16/0.45 thf(decl_74, type, esk23_1: tree_a > tree_a). 0.16/0.45 thf(decl_75, type, esk24_1: tree_a > tree_a). 0.16/0.45 thf(decl_76, type, esk25_1: tree_a > a). 0.16/0.45 thf(decl_77, type, esk26_1: tree_a > a). 0.16/0.45 thf(decl_78, type, esk27_1: tree_a > tree_a). 0.16/0.45 thf(decl_79, type, esk28_1: tree_a > tree_a). 0.16/0.45 thf(decl_80, type, esk29_1: tree_a > a). 0.16/0.45 thf(decl_81, type, esk30_1: tree_a > a). 0.16/0.45 thf(decl_82, type, esk31_1: tree_a > tree_a). 0.16/0.45 thf(decl_83, type, esk32_1: tree_a > tree_a). 0.16/0.45 thf(decl_84, type, esk33_1: tree_a > a). 0.16/0.45 thf(decl_85, type, esk34_1: tree_a > tree_a). 0.16/0.45 thf(decl_86, type, esk35_1: tree_a > tree_a). 0.16/0.45 thf(decl_87, type, esk36_1: tree_a > a). 0.16/0.45 thf(decl_88, type, esk37_1: tree_a > tree_a). 0.16/0.45 thf(decl_89, type, esk38_1: tree_a > tree_a). 0.16/0.45 thf(decl_90, type, esk39_1: (tree_a > $o) > a). 0.16/0.45 thf(decl_91, type, esk40_1: (tree_a > $o) > tree_a). 0.16/0.45 thf(decl_92, type, esk41_1: (tree_a > $o) > tree_a). 0.16/0.45 thf(decl_93, type, esk42_4: a > (a > a) > a > a > a). 0.16/0.45 thf(decl_94, type, esk43_4: a > (a > a) > a > a > a). 0.16/0.45 thf(decl_95, type, esk44_4: a > a > (a > a) > a > a). 0.16/0.45 thf(decl_96, type, esk45_4: a > a > (a > a) > a > a). 0.16/0.45 thf(decl_97, type, esk46_4: a > (a > a) > a > a > a). 0.16/0.45 thf(decl_98, type, esk47_4: a > (a > a) > a > a > a). 0.16/0.45 thf(decl_99, type, esk48_4: a > a > (a > a) > a > a). 0.16/0.45 thf(decl_100, type, esk49_4: a > a > (a > a) > a > a). 0.16/0.45 thf(decl_101, type, esk50_1: (a > a > $o) > a). 0.16/0.45 thf(decl_102, type, esk51_1: (a > a > $o) > a). 0.16/0.45 thf(decl_103, type, esk52_1: (a > a > $o) > a). 0.16/0.45 thf(decl_104, type, esk53_1: (a > a > $o) > a). 0.16/0.45 thf(conj_1, conjecture, (in_tree_a @ v @ (heapIm1091024090Down_a @ e_a)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_1)). 0.16/0.45 thf(fact_1_siftDown_Osimps_I1_J, axiom, ((heapIm1091024090Down_a @ e_a)=(e_a)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_1_siftDown_Osimps_I1_J)). 0.16/0.45 thf(conj_0, hypothesis, (in_tree_a @ v @ e_a), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)). 0.16/0.45 thf(c_0_3, negated_conjecture, ~(in_tree_a @ v @ (heapIm1091024090Down_a @ e_a)), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_1])])). 0.16/0.45 thf(c_0_4, negated_conjecture, ~((in_tree_a @ v @ (heapIm1091024090Down_a @ e_a))), inference(split_conjunct,[status(thm)],[c_0_3])). 0.16/0.45 thf(c_0_5, plain, ((heapIm1091024090Down_a @ e_a)=(e_a)), inference(split_conjunct,[status(thm)],[fact_1_siftDown_Osimps_I1_J])). 0.16/0.45 thf(c_0_6, hypothesis, (in_tree_a @ v @ e_a), inference(split_conjunct,[status(thm)],[conj_0])). 0.16/0.45 thf(c_0_7, negated_conjecture, ~((in_tree_a @ v @ e_a)), inference(rw,[status(thm)],[c_0_4, c_0_5])). 0.16/0.45 thf(c_0_8, hypothesis, ($false), inference(sr,[status(thm)],[c_0_6, c_0_7]), ['proof']). 0.16/0.45 # SZS output end CNFRefutation 0.16/0.45 # Parsed axioms : 189 0.16/0.45 # Removed by relevancy pruning/SinE : 144 0.16/0.45 # Initial clauses : 143 0.16/0.45 # Removed in clause preprocessing : 4 0.16/0.45 # Initial clauses in saturation : 139 0.16/0.45 # Processed clauses : 3 0.16/0.45 # ...of these trivial : 0 0.16/0.45 # ...subsumed : 0 0.16/0.45 # ...remaining for further processing : 2 0.16/0.45 # Other redundant clauses eliminated : 0 0.16/0.45 # Clauses deleted for lack of memory : 0 0.16/0.45 # Backward-subsumed : 0 0.16/0.45 # Backward-rewritten : 0 0.16/0.45 # Generated clauses : 0 0.16/0.45 # ...of the previous two non-redundant : 0 0.16/0.45 # ...aggressively subsumed : 0 0.16/0.45 # Contextual simplify-reflections : 0 0.16/0.45 # Paramodulations : 0 0.16/0.45 # Factorizations : 0 0.16/0.45 # NegExts : 0 0.16/0.45 # Equation resolutions : 0 0.16/0.45 # Propositional unsat checks : 0 0.16/0.45 # Propositional check models : 0 0.16/0.45 # Propositional check unsatisfiable : 0 0.16/0.45 # Propositional clauses : 0 0.16/0.45 # Propositional clauses after purity: 0 0.16/0.45 # Propositional unsat core size : 0 0.16/0.45 # Propositional preprocessing time : 0.000 0.16/0.45 # Propositional encoding time : 0.000 0.16/0.45 # Propositional solver time : 0.000 0.16/0.45 # Success case prop preproc time : 0.000 0.16/0.45 # Success case prop encoding time : 0.000 0.16/0.45 # Success case prop solver time : 0.000 0.16/0.45 # Current number of processed clauses : 2 0.16/0.45 # Positive orientable unit clauses : 1 0.16/0.45 # Positive unorientable unit clauses: 0 0.16/0.45 # Negative unit clauses : 1 0.16/0.45 # Non-unit-clauses : 0 0.16/0.45 # Current number of unprocessed clauses: 136 0.16/0.45 # ...number of literals in the above : 474 0.16/0.45 # Current number of archived formulas : 0 0.16/0.45 # Current number of archived clauses : 0 0.16/0.45 # Clause-clause subsumption calls (NU) : 0 0.16/0.45 # Rec. Clause-clause subsumption calls : 0 0.16/0.45 # Non-unit clause-clause subsumptions : 0 0.16/0.45 # Unit Clause-clause subsumption calls : 0 0.16/0.45 # Rewrite failures with RHS unbound : 0 0.16/0.45 # BW rewrite match attempts : 0 0.16/0.45 # BW rewrite match successes : 0 0.16/0.45 # Condensation attempts : 0 0.16/0.45 # Condensation successes : 0 0.16/0.45 # Termbank termtop insertions : 10046 0.16/0.45 0.16/0.45 # ------------------------------------------------- 0.16/0.45 # User time : 0.009 s 0.16/0.45 # System time : 0.005 s 0.16/0.45 # Total time : 0.014 s 0.16/0.45 # Maximum resident set size: 2584 pages 0.16/0.45 0.16/0.45 # ------------------------------------------------- 0.16/0.45 # User time : 0.015 s 0.16/0.45 # System time : 0.006 s 0.16/0.45 # Total time : 0.022 s 0.16/0.45 # Maximum resident set size: 2016 pages 0.16/0.45 EOF